The Base-matroid and Inverse Combinatorial Optimization Problems
نویسندگان
چکیده
A new matroid is introduced: this matroid is de0ned starting from any matroid and one of its bases, hence we call it base-matroid. Besides some properties of the base-matroid, a non-trivial algorithm for the solution of the related matroid optimization problem is presented. The new matroid has application in the 0eld of inverse combinatorial optimization problems. We discuss in detail the LP formulation of the inverse matroid optimization problem and we propose an e(cient algorithm for computing its primal and dual solutions. ? 2003 Elsevier Science B.V. All rights reserved.
منابع مشابه
Random Sampling and Greedy Sparsiication for Matroid Optimization Problems
Random sampling is a powerful tool for gathering information about a group by considering only a small part of it. We discuss some broadly applicable paradigms for using random sampling in combinatorial optimization, and demonstrate the eeectiveness of these paradigms for two optimization problems on matroids: nding an optimum matroid basis and packing disjoint matroid bases. Applications of th...
متن کاملImproved Approximations for k-Exchange Systems
Submodular maximization and set systems play a major role in combinatorial optimization. It is long known that the greedy algorithm provides a 1/(k + 1)-approximation for maximizing a monotone submodular function over a k-system. For the special case of k-matroid intersection, a local search approach was recently shown to provide an improved approximation of 1/(k+ δ) for arbitrary δ > 0. Unfort...
متن کاملInverse Matroid Optimization Problem under the Weighted Hamming Distances
Given a matroid equipped with a utility vector to define a matroid optimization problem, the corresponding inverse problem is to modify the utility vector as little as possible so that a given base of the matroid becomes optimal to the matroid optimization problem. The modifications can be measured by various distances. In this article, we consider the inverse matroid problem under the bottlene...
متن کاملCombinatorial Algorithms for Submodular Function Minimization and Related Problems
Submodular functions are common in combinatorics; examples include the cut capacity function of a graph and the rank function of a matroid. The submodular function minimization problem generalizes the classical minimum cut problem and also contains a number of other combinatorial optimization problems as special cases. In this thesis, we study submodular function minimization and two related pr...
متن کاملCardinality constrained combinatorial optimization: Complexity and polyhedra
Given a combinatorial optimization problem and a subset N of natural numbers, we obtain a cardinality constrained version of this problem by permitting only those feasible solutions whose cardinalities are elements of N . In this paper we briefly touch on questions that addresses common grounds and differences of the complexity of a combinatorial optimization problem and its cardinality constra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 128 شماره
صفحات -
تاریخ انتشار 2003